Exploiting Simultaneous Low-Rank and Sparsity in Delay-Angular Domain for Millimeter-Wave/Terahertz Wideband Massive Access
نویسندگان
چکیده
Millimeter-wave (mmW)/Terahertz (THz) wideband communication employing a large-scale antenna array is promising technique of the sixth-generation (6G) wireless network for realizing massive machine-type communications (mMTC). To reduce access latency and signaling overhead, we design grant-free random scheme based on joint active device detection channel estimation (JADCE) mmW/THz access. In particular, by exploiting simultaneously sparse low-rank structure channels with spreads in delay-angular domain, propose two multi-rank aware JADCE algorithms via applying quotient geometry product complex rank- $L$ matrices number clusters . It proved that proposed require smaller measurements than currently known bounds conventional recovery algorithms. Statistical analysis also shows can linearly converge to ground truth low computational complexity. Finally, extensive simulation results confirm superiority terms accuracy both activity estimation.
منابع مشابه
Exploiting Low-Rank Structure from Latent Domains for Domain Generalization
In this paper, we propose a new approach for domain generalization by exploiting the low-rank structure from multiple latent source domains. Motivated by the recent work on exemplar-SVMs, we aim to train a set of exemplar classifiers with each classifier learnt by using only one positive training sample and all negative training samples. While positive samples may come from multiple latent doma...
متن کاملImproved dynamic MRI reconstruction by exploiting sparsity and rank-deficiency.
In this paper we address the problem of dynamic MRI reconstruction from partially sampled K-space data. Our work is motivated by previous studies in this area that proposed exploiting the spatiotemporal correlation of the dynamic MRI sequence by posing the reconstruction problem as a least squares minimization regularized by sparsity and low-rank penalties. Ideally the sparsity and low-rank pen...
متن کاملDeep Unsupervised Domain Adaptation for Image Classification via Low Rank Representation Learning
Domain adaptation is a powerful technique given a wide amount of labeled data from similar attributes in different domains. In real-world applications, there is a huge number of data but almost more of them are unlabeled. It is effective in image classification where it is expensive and time-consuming to obtain adequate label data. We propose a novel method named DALRRL, which consists of deep ...
متن کاملIs Input Sparsity Time Possible for Kernel Low-Rank Approximation?
Low-rank approximation is a common tool used to accelerate kernel methods: the n × n kernel matrix K is approximated via a rank-k matrix K̃ which can be stored in much less space and processed more quickly. In this work we study the limits of computationally efficient lowrank kernel approximation. We show that for a broad class of kernels, including the popular Gaussian and polynomial kernels, c...
متن کاملAn Efficient, Sparsity-Preserving, Online Algorithm for Low-Rank Approximation
Low-rank matrix approximation is a fundamental tool in data analysis for processing large datasets, reducing noise, and finding important signals. In this work, we present a novel truncated LU factorization called Spectrum-Revealing LU (SRLU) for effective low-rank matrix approximation, and develop a fast algorithm to compute an SRLU factorization. We provide both matrix and singular value appr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Wireless Communications
سال: 2022
ISSN: ['1536-1276', '1558-2248']
DOI: https://doi.org/10.1109/twc.2021.3111225